Zero-Content Augmented Cache

نویسندگان

  • Julien Dusser
  • Thomas Piquet
  • André Seznec
چکیده

It has been observed that some applications manipulate large amounts of null data. Moreover these zero data often exhibit high spatial locality. On some applications more than 20% of the data accesses concern null data blocks. Representing a null block in a cache on a standard cache line appears as a waste of resources. In this paper, we propose the Zero-Content Augmented cache, the ZCA cache. A ZCA cache consists of a conventional cache augmented with a specialized cache for memorizing null blocks, the Zero-Content cache or ZC cache. In the ZC cache, the data block is represented by its address tag and a validity bit. Moreover, as null blocks generally exhibit high spatial locality, several null blocks can be associated with a single address tag in the ZC cache. For instance, a ZC cache mapping 32MB of zero 64-byte lines uses less than 80KB of storage. Decompression of a null block is very simple, therefore read access time on the ZCA cache is in the same range as the one of a conventional cache. On applications manipulating large amount of null data blocks, such a ZC cache allows to significantly reduce the miss rate and memory traffic, and therefore to increase performance for a small hardware overhead. In particular, the write-back traffic on null blocks is limited. For applications with a low null block rate, no performance loss is observed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What, When and Where to Cache: A Unified Optimization Approach

Caching algorithms are usually described by the eviction method and analyzed using a metric of hit probability. Since contents have different importance (e.g. popularity), the utility of a high hit probability, and the cost of transmission can vary across contents. In this paper, we consider timer-based (TTL) policies across a cache network, where contents have differentiated timers over which ...

متن کامل

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

On Multi-Server Coded Caching in the Low Memory Regime

In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small.We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at the content delivery phase. Surprisingly, in contrast to previous multi-server results which were proved to be order-optimal within a multiplicative factor of ...

متن کامل

Cache-Augmented Latent Topic Language Models for Speech Retrieval

We aim to improve speech retrieval performance by augmenting traditional N-gram language models with different types of topic context. We present a latent topic model framework that treats documents as arising from an underlying topic sequence combined with a cache-based repetition model. We analyze our proposed model both for its ability to capture word repetition via the cache and for its sui...

متن کامل

A Configuration Tool for Caching Dynamic Pages

The efficacy of a fragment-based caching system fundamentally depends on the fragments’ definition and the bringing into play of mechanisms that improve reuse and guarantee the consistency of the cache content (notably “purification” and invalidation mechanisms). Existing caching systems assume that the administrator provides the required configuration data manually, which is likely to be a hea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009